Online visibility graphs: Encoding visibility in a binary search tree
نویسندگان
چکیده
منابع مشابه
Tree-visibility Orders Tree-visibility Orders
In this paper we introduce a new class of partially ordered sets, called tree-visibility orders, extending the class of interval orders in a fashion similar to the extension of interval graphs to chordal graphs. This class contains interval orders, duals of generalized interval orders and height one orders. We give a characterization of tree-visibility orders by an innnite family of minimal for...
متن کاملTree-visibility orders
We introduce a new class of partially ordered sets, called tree-visibility orders, containing interval orders, duals of generalized interval orders and height one orders. We give a characterization of tree-visibility orders by an innnite family of minimal forbidden suborders. Furthermore we present an eecient recognition algorithm for tree-visibility orders.
متن کاملBAR k-VISIBILITY GRAPHS
Die selbständige und eigenhändige Anfertigung versichere ich an Eides statt. Conclusion 71 Bibliography 75 Introduction " The true mystery of the world is the visible, not the invisible. " Oscar Wilde How can geometric settings be encoded combinatorially? Which discrete structures extract the essential information from continuous arrangements? How can the combinatorial properties of visibility ...
متن کاملVisibility Graphs and Oriented
We describe a set of necessary conditions for a given graph to be the visibility graph of a simple polygon. For every graph satisfying these conditions we show that a uniform rank 3 oriented matroid can be constructed in polynomial time, which if affinely coordinatizable yields a simple polygon whose visibility graph is isomorphic to the given graph.
متن کاملVisibility Graphs of Towers
A tower is a polygon consisting of two reflex chains sharing one common endpoint, together with one edge joining the other endpoints of the chains. A linear time algorithm is given to recognize the [vertex] visibility graphs of towers, and these graphs are characterized as bipartite permutation graphs with an added Hamiltonian cycle. Similar results have been obtained independently by Choi, Shi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Research
سال: 2020
ISSN: 2643-1564
DOI: 10.1103/physrevresearch.2.023069